Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

merge2(nil, y) -> y
merge2(x, nil) -> x
merge2(.2(x, y), .2(u, v)) -> if3(<2(x, u), .2(x, merge2(y, .2(u, v))), .2(u, merge2(.2(x, y), v)))
++2(nil, y) -> y
++2(.2(x, y), z) -> .2(x, ++2(y, z))
if3(true, x, y) -> x
if3(false, x, y) -> x

Q is empty.


↳ QTRS
  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

merge2(nil, y) -> y
merge2(x, nil) -> x
merge2(.2(x, y), .2(u, v)) -> if3(<2(x, u), .2(x, merge2(y, .2(u, v))), .2(u, merge2(.2(x, y), v)))
++2(nil, y) -> y
++2(.2(x, y), z) -> .2(x, ++2(y, z))
if3(true, x, y) -> x
if3(false, x, y) -> x

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

MERGE2(.2(x, y), .2(u, v)) -> MERGE2(y, .2(u, v))
MERGE2(.2(x, y), .2(u, v)) -> IF3(<2(x, u), .2(x, merge2(y, .2(u, v))), .2(u, merge2(.2(x, y), v)))
MERGE2(.2(x, y), .2(u, v)) -> MERGE2(.2(x, y), v)
++12(.2(x, y), z) -> ++12(y, z)

The TRS R consists of the following rules:

merge2(nil, y) -> y
merge2(x, nil) -> x
merge2(.2(x, y), .2(u, v)) -> if3(<2(x, u), .2(x, merge2(y, .2(u, v))), .2(u, merge2(.2(x, y), v)))
++2(nil, y) -> y
++2(.2(x, y), z) -> .2(x, ++2(y, z))
if3(true, x, y) -> x
if3(false, x, y) -> x

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

MERGE2(.2(x, y), .2(u, v)) -> MERGE2(y, .2(u, v))
MERGE2(.2(x, y), .2(u, v)) -> IF3(<2(x, u), .2(x, merge2(y, .2(u, v))), .2(u, merge2(.2(x, y), v)))
MERGE2(.2(x, y), .2(u, v)) -> MERGE2(.2(x, y), v)
++12(.2(x, y), z) -> ++12(y, z)

The TRS R consists of the following rules:

merge2(nil, y) -> y
merge2(x, nil) -> x
merge2(.2(x, y), .2(u, v)) -> if3(<2(x, u), .2(x, merge2(y, .2(u, v))), .2(u, merge2(.2(x, y), v)))
++2(nil, y) -> y
++2(.2(x, y), z) -> .2(x, ++2(y, z))
if3(true, x, y) -> x
if3(false, x, y) -> x

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 2 SCCs with 1 less node.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
            ↳ QDPOrderProof
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

++12(.2(x, y), z) -> ++12(y, z)

The TRS R consists of the following rules:

merge2(nil, y) -> y
merge2(x, nil) -> x
merge2(.2(x, y), .2(u, v)) -> if3(<2(x, u), .2(x, merge2(y, .2(u, v))), .2(u, merge2(.2(x, y), v)))
++2(nil, y) -> y
++2(.2(x, y), z) -> .2(x, ++2(y, z))
if3(true, x, y) -> x
if3(false, x, y) -> x

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


++12(.2(x, y), z) -> ++12(y, z)
The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial interpretation [21]:

POL(++12(x1, x2)) = x1   
POL(.2(x1, x2)) = 1 + x2   

The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ PisEmptyProof
          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

merge2(nil, y) -> y
merge2(x, nil) -> x
merge2(.2(x, y), .2(u, v)) -> if3(<2(x, u), .2(x, merge2(y, .2(u, v))), .2(u, merge2(.2(x, y), v)))
++2(nil, y) -> y
++2(.2(x, y), z) -> .2(x, ++2(y, z))
if3(true, x, y) -> x
if3(false, x, y) -> x

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

MERGE2(.2(x, y), .2(u, v)) -> MERGE2(y, .2(u, v))
MERGE2(.2(x, y), .2(u, v)) -> MERGE2(.2(x, y), v)

The TRS R consists of the following rules:

merge2(nil, y) -> y
merge2(x, nil) -> x
merge2(.2(x, y), .2(u, v)) -> if3(<2(x, u), .2(x, merge2(y, .2(u, v))), .2(u, merge2(.2(x, y), v)))
++2(nil, y) -> y
++2(.2(x, y), z) -> .2(x, ++2(y, z))
if3(true, x, y) -> x
if3(false, x, y) -> x

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


MERGE2(.2(x, y), .2(u, v)) -> MERGE2(y, .2(u, v))
MERGE2(.2(x, y), .2(u, v)) -> MERGE2(.2(x, y), v)
The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial interpretation [21]:

POL(.2(x1, x2)) = 3 + x2   
POL(MERGE2(x1, x2)) = 3·x1 + 3·x2   

The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ PisEmptyProof

Q DP problem:
P is empty.
The TRS R consists of the following rules:

merge2(nil, y) -> y
merge2(x, nil) -> x
merge2(.2(x, y), .2(u, v)) -> if3(<2(x, u), .2(x, merge2(y, .2(u, v))), .2(u, merge2(.2(x, y), v)))
++2(nil, y) -> y
++2(.2(x, y), z) -> .2(x, ++2(y, z))
if3(true, x, y) -> x
if3(false, x, y) -> x

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.